Description: 用C#编的用遗传算法求解旅行商（TSP）问题的源代码。-with C# Part of the Genetic Algorithm for TSP (TSP) of the source code. Platform: |
Size: 7168 |
Author:流程 |
Hits:
Description: 一个用变形贪婪法解货郎回路的C程序代码 思想 1．选择一条最短的边作为部分解。 2．选择一条最短的且将之加入到部分解不形成回路的边。 3．重复第2步，直至所有的结点都包含在部分解中。-deformation with a greedy method for the Traveling Salesman circuit C code ideological one. Choose a minimum as part of the solution side. 2. Choose one of the shortest but to incorporate it into solutions that do not form part of the loop side. 3. Repeat Step 2 until all the nodes are included in some solution. Platform: |
Size: 13312 |
Author:莫非 |
Hits:
Description: 本软件主要用于帮助计算机爱好者学习蚁群算法时做有关蚁群算法的试验。蚁群算法作为一种优秀的新兴的算法，具有非常广的应用前景，越来越多的人开始学习蚁群算法，因此本软件也有推广前景。
本软件除了用于教学目的外，还可用于解决实际生活中的与TSP（即，旅行商问题）问题相关的问题。
TSP问题描述的是一个旅行商要到几个城市去，每个城市必须去一次且仅能去一次，要求满足这样条件的
最短路径。将本软件稍作扩展即可用于城市规划、公交车路径安排等多种约束满足问题。
-the software used to help computer enthusiasts Ant learning algorithm to do the ant colony algorithm tests. Ant Algorithm as a good new algorithm has a very broad application prospects, more and more people begin to learn ant colony algorithm, the software also promote the prospects. In addition to the software for teaching purposes, can also be used to solve real life with TSP (ie, the traveling salesman problem) issues related issues. TSP is a description of the TSP to several cities, each city must go only to one that once such conditions are met the shortest path. Some of this software can be extended for city planning, public transportation vehicles and other arrangements path constraint satisfaction problems. Platform: |
Size: 1024 |
Author:李誉 |
Hits:
Description: 本程序用另外一种算法即近邻算法解决ＴＳＰ，即旅行商问题，请高手指教．-this procedure with the other algorithms that solve the TSP neighbor algorithm, the traveling salesman problem, experts advise. Platform: |
Size: 12288 |
Author:chen |
Hits:
Description: 首先介绍了当前求解TSP问题最好的演化算法之一：GT算法。文中重点设计了在NOW上求解旅行商问题GT算法的并行算法，详细描述了设计思路，设计策略。还给出了相当详细的并行算法描述。文中设计的并行算法已经在NOW上的PVM平台上实现。关键词NOW，演化计算，旅行商问题,并行计算-first briefed on the current TSP evolutionary algorithm best one : GT algorithm. The article focused on the design of the NOW on solving the traveling salesman problem GT algorithm parallel algorithm, described in detail the design concept, design strategy. Also given a fairly detailed description of the parallel algorithm. The text of parallel algorithm design in NOW's PVM achieve. Keywords NOW, evolutionary computation, the traveling salesman problem, parallel computing Platform: |
Size: 199680 |
Author:巨金华 |
Hits:
Description: 用遗传算法编写的一个程序,其目的是求解旅行商问题.-genetic algorithm a procedure for the preparation, with the aim of solving the traveling salesman problem. Platform: |
Size: 1024 |
Author:吴广超 |
Hits:
Description: 用模拟退火技术解决旅行商问题.算法中采用了人工智能中比较新的模拟退火算法.-simulated annealing technology to solve the traveling salesman problem. Algorithms used in the artificial intelligence relatively new simulated annealing algorithm. Platform: |
Size: 101376 |
Author:刘先生 |
Hits:
Description: 一个java的小程序,用SOM网络解决的是TSP问题.问题的大小可以自由变化,随机生成权值-a small program that will solve the SOM is TSP. The size of the problem can freely change randomly generated weights Platform: |
Size: 26624 |
Author:于帆 |
Hits:
Description: 利用C++编写蚁群优化算法解决51城市旅行商问题-prepared Ant Colony Optimization Algorithm for 51 city Traveling Salesman Problem Platform: |
Size: 5120 |
Author: |
Hits:
Description: 采用C++语言编写蚁群优化算法程序，解决旅行商问题-using C language ant colony optimization algorithm to solve the traveling salesman problem Platform: |
Size: 5120 |
Author: |
Hits:
Description: 物流分析工具包。Facility location: Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated facility location
Vehicle routing: VRP, VRP with time windows, traveling salesman problem (TSP)
Networks: Shortest path, min cost network flow, minimum spanning tree problems
Geocoding: U.S. city or ZIP code to longitude and latitude, longitude and latitude to nearest city, Mercator projection plotting
Layout: Steepest descent pairwise interchange (SDPI) heuristic for QAP
Material handling: Equipment selection
General purpose: Linear programming using the revised simplex method, mixed-integer linear programming (MILP) branch and bound procedure
Data: U.S. cities with populations of at least 10,000, U.S. highway network (Oak Ridge National Highway Network), U.S. 3- and 5-digit ZIP codes -logistics analysis tool kit. Facility location : Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated Vehicle routing facility location : VRP, VRP with time windows, the traveling salesman problem (TSP) Networks : Shortest path, min cost network flow, minimum spanning tree Geocoding problems : world city or ZIP code to longitude and latitude, longitude and latitude to nearest city, Mercator projection plotting Layout : Steepest descent Pairwise interchange (Constituencies) heuristic for QAP Material handling : Equipment selection General purpose : Linear programming using the revised simplex method, mixed-integer linear programming programming (MILP) branch and bound procedure Data : world cities with populations of at least 10,000, U. Platform: |
Size: 4853760 |
Author:陈宝文 |
Hits:
Search - the traveling salesman